Analysing Mailboxes of Asynchronous Communicating Components

نویسندگان

  • Jean-Claude Royer
  • Michael Xu
چکیده

Asynchronous communications are prominent in distributed and mobile systems. Often concurrent systems consider an abstract point of view with synchronous communications. However it seems more realistic and finer to consider asynchronous communicating systems, since it provides a more primitive communication protocol and maximize the concurrency. Several languages and models have been defined using this communication mode: agent, actor, mobile computation, and so on. Here we reconsider a previous component model with full data types and synchronous communications with an asynchronous flavour. The dynamic behaviour of a component is represented as a structured symbolic transition system with mailboxes. We also present an algorithm devoted to an analysis of the dynamic behaviour of the system. This algorithm decides if the system has bound mailboxes and computes the reachable mailbox contents of the system. The component model and the algorithm are illustrated on a flight system reservation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A PVS Experiment with Asynchronous Communicating Components DRAFT

In our previous work we defined an approach based on symbolic transition system and data type to specify and verify mixed systems. We applied this to components and architectures with full data types, and synchronous communications. However to fit distributed systems, it seems more realistic to consider asynchronous communications. It provides a more primitive communication protocol and maximiz...

متن کامل

Notes About Automatic Generation for Argument Retrieval in Asynchronous Communicating STS DRAFT

In our previous work, we defined an approach for specifying components and architectures using a combination of symbolic transition systems, data types, and synchronous communications. We extend this approach with asynchronous communications. In this setting, specifications and proofs are complicated by the presence of buffers and the fact that the receipt time of a message is distinct from its...

متن کامل

Checking Asynchronously Communicating Components Using Symbolic Transition Systems

Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reuse, coordination, adaptation and verification issues. Such protocol languages often deal with synchronous communication. However, in the context of distributed systems, components communicating asynchronously through mailboxes ...

متن کامل

Equations for Asynchronous Message Passing

In [Cza 2006] fix-point equations specifying synchronous (”hand-shaking”) communication in distributed systems have been proposed. Their solution yielded a communication network of agents, directly presented as a Petri net-like structure, and determined the global state of the specified system. The net-places represented agents, while transitions transfer of messages. A special algebra being a ...

متن کامل

A Formal Model of Asynchronous Broadcast Communication

We present a mathematical model, called Asynchronous Broadcast Networks (ABN), of distributed computation based on topology-dependent and asyn-chronous communication. Our model combines three main features: a graph representation of a network configuration decoupled from the specification of individual process behavior, a topology-dependent semantics of synchronization, the use of local mailbox...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003